Tuple Refinement Method Based on Relationship Keyword Extension
نویسندگان
چکیده
Entity relation extraction is mainly focused on researching extraction approaches and improving precision of the extraction results. Although many efforts have been made on this field, there still exist some problems. In order to improve the performance of extracting entity relation, we propose a tuple refinement method based on relationship keyword extension. Firstly, we utilize the diversity of relationships to extend relationship keywords, and then, use the redundancy of network information to extract the second entity based on the principle of proximity and the predefined entity type. Under open web environment, we take four relationships in the experiments and adopt bootstrapping algorithm to acquire the initial tuple set. Three tuple refinement methods are compared: refinement method with threshold set, refinement method with relation extension and refinement method without relation extension. The average F-scores of the experimental results show the proposed method can effectively improve the performance of entity relation extraction.
منابع مشابه
A Hybrid Multi-attribute Group Decision Making Method Based on Grey Linguistic 2-tuple
Because of the complexity of decision-making environment, the uncertainty of fuzziness and the uncertainty of grey maybe coexist in the problems of multi-attribute group decision making. In this paper, we study the problems of multi-attribute group decision making with hybrid grey attribute data (the precise values, interval numbers and linguistic fuzzy variables coexist, and each attribute val...
متن کاملFusion Layer Topological Space Query Indexing For Uncertain Data Mining
Data uncertainty is an intrinsic property in different applications such as sensor network monitoring, object recognition, location-based services (LBS), and moving object tracking. The data mining methods are applied to the above mentionedapplications their uncertainty has to be handled to achieve the accurate query results. The several probabilistic algorithm estimates the location and contro...
متن کاملAuction-based Agent Negotiation via Programmable Reactive Tuple Spaces
Auctions are proposed as a distributed negotiation mean, particularly useful in multiagent systems where self-interested agents compete for resources. The Internet is the most known example of environment where agents belonging to different applications exploit the available resources and services. The aim of this paper is to show how auction mechanisms can be easily implemented by using progra...
متن کاملRetune: Retrieving and Materializing Tuple Units for Effective Keyword Search over Relational Databases
The existing approaches of keyword search over relational databases always identify the relationships between tuples on the fly, which are rather inefficient as such relational relationships are very rich in the underlying databases. Alternatively, this paper proposes an alternative way by retrieving and materializing tuple units for facilitating the online processing of keyword search. We firs...
متن کاملEffective Keyword Search in XML Documents Based on MIU
Keyword search is an effective approach for most users to search for information because they do not need to learn complex query languages or the underlying structures of the data. This paper focuses on effective keyword search in XML documents which are modeled as labeled trees. We first analyze the problems caused by the refinement of result granularity during XML keyword search and then prop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012